Optimally Rotated Vectors
نویسنده
چکیده
We study vectors which undergo maximum or minimum rotation by a matrix on the field of real numbers. The cosine of the angle between a maximally rotated vector and its image under the matrix is called the cosine or antieigenvalue of the matrix and has important applications in numerical methods. Using Lagrange multiplier technique, we obtain systems of nonlinear equations which represent these optimization problems. Furthermore, we solve these systems symbolically and numerically.
منابع مشابه
Rotated Word Vector Representations and their Interpretability
Vector representation of words improves performance in various NLP tasks, but the high-dimensional word vectors are very difficult to interpret. We apply several rotation algorithms to the vector representation of words to improve the interpretability. Unlike previous approaches that induce sparsity, the rotated vectors are interpretable while preserving the expressive performance of the origin...
متن کاملDiagnosing Multistage Manufacturing Processes With Engineering-Driven Factor Analysis Considering Sampling Uncertainty
A new engineering-driven factor analysis (EDFA) method has been developed to assist the variation source identification for multistage manufacturing processes (MMPs). The proposed method investigated how to fully utilize qualitative engineering knowledge of the spatial variation patterns to guide the factor rotation. It is shown that ideal identification can be achieved by matching the rotated ...
متن کاملKarhunen–Loéve Expansion of a Set of Rotated Templates
In this paper, we propose a novel method for efficiently calculating the eigenvectors of uniformly rotated images of a set of templates. As we show, the images can be optimally approximated by a linear series of eigenvectors which can be calculated without actually decomposing the sample covariance matrix.
متن کاملOptimal approximation of uniformly rotated images: relationship between Karhunen-Loeve expansion and discrete cosine transform
We present the concept that for uniformly rotated images, the optimal approximation of the images can be obtained by computing the basis vectors for the discrete cosine transform (DCT) of the original image in polar coordinates, and that the images can be represented as linear combinations of the basis vectors.
متن کاملA Lattice Basis Reduction Algorithm ∗
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a shortest basis for the lattice. Then we present an algorithm for computing an approximation of an optimally reduced basis for a lattice using a novel unimodular transformation. To compare lattice bases, we propose a quantitative measure of the degree of the linear in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002